On computing rational Gauss-Chebyshev quadrature formulas

We provide an algorithm to compute the nodes and weights for Gauss-Chebyshev quadrature formulas integrating exactly in spaces of rational functions with arbitrary real poles outside [−1, 1]. Contrary to existing rational quadrature formulas, the computational effort is very low, even for extremely high degrees, and under certain conditions on the poles it can be shown that the complexity is of order O(n). This method is based on the derivation of explicit expressions for Chebyshev orthogonal rational functions, which are (thus far) the only examples of explicitly known orthogonal rational functions on [−1, 1] with arbitrary real poles outside this interval.